Constrained Trilinear Decomposition with Application to Array Signal Processing

This paper links the constrained trilinear tensor model into array signal processing. The structure properties of baseband signal, such as the Constant-Modulus (CM) and Finite Alphabet (FA) structures which are already known in the receiving array, are exploited in trilinear decomposition. Two novel algorithms for constrained trilinear decomposition are proposed and applied to array signal processing. The distinguishing features of the proposed model and algorithms compared to the traditional trilinear signal processing methods are: (i) the proposed model has a better performance and lower computation complexity. (ii) it can still work well even if degeneracy of factors are involved in the data model, which is not valid in traditional algorithms. Simulation results are presented to illustrate the application of the constrained trilinear decomposition to array signal processing and evaluate the performance of the proposed algorithms in DOAs estimation.